Inference Rights for Controlling Search in Generating Theorem Provers

We investigate the usage of so-called inference rights. We point out the problems arising from the innexibility of existing approaches to heuristically control the search of automated deduction systems, and we propose the application of inference rights that are well-suited for controlling the search more exibly. Moreover , inference rights allow for a mechanism of \partial forgetting" of facts that is not realizable in the most controlling aproaches. We study theoretical foundations of inference rights as well as the integration of inference rights into already existing inference systems. Furthermore, we present possibilities to control such modiied inference systems in order to gain eeciency. Finally, we report on experimental results obtained in the area of condensed detachment.